
/*
*Pool Public Licence version 0.1 or later
*Released on 20th April 2008.
*Any voilations can be repoted at paritosh@wikiocean.net
*What is treated as voilations can be found at www.wikiocean.net/ppl1-voilations* 
******************************************************************************
* The contents of this file are subject Affero GPL v3 and later with additional conditions.
* The additional conditions are to be considered as part of the Affero GPL v3 and later.
* The additional conditions will supersede the Affero GPLv3 and later in case of conflict.
* ("License"); You may not use this file except in compliance with the License
* You may obtain a copy of the License at http://www.gnu.org/licenses/agpl.html
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
* the specific language governing rights and limitations under the License.
* The Initial Developer of the Original Code is Paritosh Pungaliya.
* created by Paritosh Pungaliya are Copyright (C) Paritosh Pungaliya; All Rights Reserved.
* Contributions are Copyright (C) 2001-2008 Paritosh Pungaliya.

* Objective of the additional terms (license) 
* 1) Is to extend the software freedom to freedom to work.
* 2) To ensure that knowledge is free from monopoly of agencie(s).
* 3) To avoid a situation where big corporates or investors can buy out free software groups and companies and then start milking the communities built around it.
* (this trend can be seen how the openness changes in companies that get Venture Capital funding.)
* (if you agree to this logic I invite you to our group to work together)

* Additional conditions
*  0) Source code will also include
* 	a) data dictionaries, data ontologies which are used to alter the behavior of code or to control           the features of application.
* 	b) Any code generated or derived automatically or manually from this code or logic
*  1) The revenue generated by deploying, implementing , selling services and other activities
*  	 based on this source code should be shared 100%, between the people working on it.
*  2) Capital invested should be given only fixed rate of return or linked to revenue/surplus growth for limited time.
*  3) People working on the project should always have an option to replace the capital provider in full or part with lower cost capital.
*  4) Their should not be any ownership which can be sold as a claim on future profit to be generated from the work of people working on the code.
*  5) Brand thus generated should belong to the group.
*  6) For old and new members revenue sharing should be equal for same work equivalent.
*  7) The share of revenue should be decided by bidding for work before allocation of work within the group.
*  8) Before bidding various method of measuring the work should be clearly defined and published in public domain. Any change in process should also be publised in public domain imediately.
*  9) All data related to to revenue sharing should be published as and when generated in public domain.
*  10) For group of people having size more than 10 people will have to make it open online for others to participate in bids. 
*  11) All people involved in related and sub project will be treated as a group.
*  12) Once this license is being used for a certain code then all and any other software services being provided by the group should complusorilly come under 100% revenue sharing.
*  13) Cross subsidization should not happen under this revenue share, no additional benefit should be drawn from the people, by the employing agency.
*  14) Any position or knowledge or legal structure created relating to people working on code, which adversely affects the spirit of 100% revenue share will be treated as a violation.
*  15) Revenue sharing defined.
*     a) includes direct revenue and also intangible gains like brand, and organization.
*     b) No personal judgment should be involved in judging the distribution of revenue.It has to be pre-defined formula based.
*     c)100% of revenue should be shared before expenses and recievers should have control over what expenses to incur.
*     d)For the work done in any month by contributing group member, working on any project can be given revenue share from the work done by the group, for a maximum of 18 months after that month.
*     e)Revenue should be apportioned to the month in which work is done and not when received.
*  The group fulfilling the above conditions also has to be a wiki ecosystem further defined in www.wekosystem.org or read about Wekosystem at www.wikiocean.net

*  ******************************************************************************
*/  
package smsBean;

import java.util.ArrayList;
import java.util.Hashtable;
import java.util.Stack;
import java.util.Vector;

import control.SpecialCharacter;

import utility.CharAt;
import utility.Index;

import utility.SplitString;

/**
 * 
 * @author SplitRequest
 * splitrequest is used to accepts multiple requests through a single message.
 * e.g. in a single request we can add a different requests of  master ,property_details,
 * transaction,trans_property_details,transaction_details,td_property_details,dictionary etc.
 */

public class SplitRequest 
{
	Stack<Object> st=new Stack<Object>();
	int PrefixIndex = 0;
	int SuffixIndex = 0;
	Hashtable<Object,Object> RequestMap = new Hashtable<Object, Object>();
	Vector<Object> splitVector=new Vector<Object>();
	
	ArrayList<Object> arr =new ArrayList<Object>() ;
	String msg;

	SplitString split=new SplitString();
	
	public SplitRequest(){}
	/**
	 * 
	 * @param message It receives the multiple requests in a single message
	 * and sends to the splithash() for further processing.
	 * @return 
	 */
	public Vector<Object> splitRequest(String message) 
	{
		
		StringBuffer sbr =splitHash(new StringBuffer (message));
		if(sbr.toString().contains("Error"))
		 {
			 splitVector.clear();			
		 }
		System.out.println(splitVector);
		return splitVector;
	}
	

	/**
	 * @param messageBuffer This Stringbuffer which appends prefix,string
	 * and its suffix. 
	 * @return messageBuffer
	 */
	public StringBuffer splitHash(StringBuffer messageBuffer)
	{
		boolean FLAG = true;
		String str="";
		int start=0;
		int sp=0;
		int end=0;
		StringBuffer suffix=null;
		StringBuffer prefix=null;
		String[] hash=null;
		String message=messageBuffer.toString();
		StringBuffer psb=new StringBuffer();
		//Command cp=new Command();
		SpecialCharacter cp = new SpecialCharacter();
		String password=message.substring(cp.getPrevSpChar(message.length(), message.toCharArray()));
		password=password.substring(1);
		int propertyIndex=0;
		while(message.length()!=0)
		{
			String spchar = null;
			sp=cp.getNextSpChar(sp, message.toCharArray());
			try
			{
			 spchar=""+message.charAt(sp);
			}
			catch(Exception e)
			{
				return new StringBuffer("Error");
			}
			if(spchar.equals(""+'('))
			{
				st.push(sp);
				
				FLAG = false;
				continue;
			}
			else if(spchar.equals(""+')'))
			{
				FLAG = false;
				st.push(sp);
				
				try
				{
					end=(Integer)st.pop();
					start=(Integer)st.pop();
				}
				catch(Exception e)
				{					
					return new StringBuffer("Error");
				}
				str=message.substring(start+1,end);
				boolean check=true;
				if(!str.contains("#"))
			   	{			   		
			   		int ch=0;
					String property=null;
			  		char schar;
			  		
			  		schar=CharAt.CharAT(str, ch);
			  		
			  		check=cp.checkSpchar(str, 0);
			  		if(check==false)
			  		{
			  			return new StringBuffer("Error");
			  		}
			  		try
			  		{
			  			hash=split.split(str,String.valueOf(schar));
			  		}
			  		catch(Exception e)
			  		{
			  			return new StringBuffer("Error");
			  		}
			  		propertyIndex=cp.getPrevSpChar(start,message.toCharArray());
			  		property=message.substring(cp.getPrevSpChar(start,message.toCharArray()),start );
			  		prefix=prefixAdd(message,propertyIndex);
			  		psb.append(prefix);
			  		for(int i=0;i<hash.length;i++)
				   	{
				   		if(hash[i].length()==0)
				   		{
				   			continue;
				   		}
			   			
				   		psb.append(property);
			   			psb.append(schar);
			   			psb.append(hash[i]);
			   			
				   	}
				   break;
				}
			 else
			 {
				  	prefix=prefixAdd(message,start);
					hash=str.split("#");
					try
					{
						suffix=suffixAdd(message,end);  
					}
					catch (Exception e)
					{
						return new StringBuffer("Error");
					}
				  	messageBuffer = new StringBuffer();
					messageBuffer.append(message.substring(0,PrefixIndex));
				  	for(int i=0;i<hash.length;i++)
				   	{
				   		StringBuffer sb=new StringBuffer();
				   		sb.append(""+prefix);
				   		sb.append(hash[i]);
				   		sb.append(suffix);
				   		messageBuffer.append(sb+"#");
				   	}
				   	messageBuffer.append(message.substring(SuffixIndex));
				 	break;
			}
			}
			else if(spchar.equals("#"))
			{
				if(FLAG==true)
				{
					String msg =message.substring(0,sp+1);
					StringBuffer sb = new StringBuffer();
					sb.append(msg);
					sb.append(password);
										               
					splitVector.add(sb.toString());
					message = message.substring(sp+1);
					if(!message.contains(spchar))
					{
						message="";
						return new StringBuffer("");
					}
					else
					{
						messageBuffer  = splitHash(new StringBuffer(message));
						message = messageBuffer.toString();
					}
				}
			}
			
		}
		try
		{
			if(!str.contains("#"))
			{
				String subString=null;
				String ps =null;
				subString=message.substring(PrefixIndex, end+1);
				ps =psb.toString();
				message=message.replace(subString,ps);
				messageBuffer=new StringBuffer(message);
			}
		}
		catch (Exception e)
		{
			// TODO: handle exception
		}
		
		if(message.length()<=0)
			return new StringBuffer("");
		messageBuffer  = splitHash(messageBuffer);
	
		return messageBuffer;
	}
	public StringBuffer prefixAdd(String msg,int index)
	{
		int start=0;
		StringBuffer strbf = new StringBuffer();
		String message = msg;
		int sp=0;
		SpecialCharacter cp = new SpecialCharacter();
		while(message.length()!=index)
		{
			message = msg.substring(start,index);
			sp=cp.getNextSpChar(sp,message.toCharArray());
			if(sp==index)
			{
				message = msg.substring(0,index);
				strbf.append(message);
				PrefixIndex = 0;
				return strbf;
			}
			String spchar=" "+message.charAt(sp);		
			
			if(spchar.equals(" "+'('))
			{
				message = msg.substring(sp+1,index);
				strbf.append(message);
				PrefixIndex = sp+1;
				return strbf;
			}
			
		}	
		PrefixIndex = 0;
		return strbf.append(message.substring(0, index));
	}
	public StringBuffer suffixAdd(String msg,int index)
	{
		int start = index;
		StringBuffer strbf = new StringBuffer();
		String message = msg;
		int end = Index.indexOf(message,"#",start);
		SuffixIndex = end+1;
		message = msg.substring(start+1,end);
		strbf.append(message);
		return strbf;
	}
	
	
	public String TrimMessage(String message)
	{			
		message=message.trim();									
			if(message.contains(" "))
			{					
					  arr.add(message.substring(0,message.indexOf(" ")));
					 message=message.substring(message.indexOf(" ")).trim();
					  TrimMessage(message);					
			}
			else
			{
				 arr.add(message);
				 message="";
			}				
			
			StringBuffer sb = new StringBuffer();
			if(arr.size()!=0)
			{
				for(int i=0; i<arr.size();i++)
				{			 
					sb.append(arr.get(i));
					sb.append(" ");					
				}
				arr.clear();
				msg=sb.toString();
			}
				
		return msg.trim();
	}	

	
	
	public static void main(String args[])
	{
		SplitRequest sp=new SplitRequest();
	//	sp.splitRequest("11 master (add *ABC |name(:shrijita:Kirti:Namita) |city(:pune:Latur:Mumbai)# mod ,lmn*pqr)#11 transaction add *po(<aab>aac,aaa20# <aac>aad,aaa50 )#605");
	//	sp.splitRequest("11 master(add *28|Reference(:shriji:kirti:Namita),aaa20 # mod *45|Reference$ffff:shri!0)#605");
	//	sp.splitRequest("11 transaction (add*PO<aaa>adc|Reference(:adc:aaa:abb),aaa20?color(:blue!1:red!2)#mod @51*po:aab )#605");
		
		sp.splitRequest("11 master_table add * hello #11 property_details (add *DDD | city : Shimla #mod * DDD |city $ Raipur : Pune |add ($ CG : Mah $ Gujarat : MH )) # 605");
		
	}
}

